Optimal communication schemes in a complex network : From trees to bottleneck networksCRIADO, R; FLORES, J; PELLO, J et al.The European physical journal. Special topics. 2007, Vol 146, pp 145-154, 10 p.Article

Schematic methods for probabilistic enzyme kineticsMAZUR, A. K; KUCHINSKI, A. V.Journal of theoretical biology. 1992, Vol 155, Num 3, pp 387-407, issn 0022-5193Article

Pre-processing and linear-decomposition algorithm to solve the k-colorability problemLUCET, Corinne; MENDES, Florence; MOUKRIM, Aziz et al.Lecture notes in computer science. 2004, pp 315-325, issn 0302-9743, isbn 3-540-22067-4, 11 p.Conference Paper

Heuristics for multimode scheduling problems with dedicated resourcesBIANCO, L; DELL'OLMO, P; SPERANZA, M. G et al.European journal of operational research. 1998, Vol 107, Num 2, pp 260-271, issn 0377-2217Conference Paper

Recherche des N meilleurs solutions et post-traitements, en reconnaissance de la parole = N best solutions algorithm and post-processings in speech recognitionLokbani, Mohamed; Lienard, Jean-Sylvain.1993, 200 p.Thesis

Encoding shoe sole patterns using multilayer graphsPARK, J.Electronics letters. 2012, Vol 48, Num 20, pp 1266-1268, issn 0013-5194, 3 p.Article

Urban traffic from the perspective of dual graphHU, M.-B; JIANG, R; WU, Y.-H et al.The European physical journal. B, Condensed matter physics. 2008, Vol 63, Num 1, pp 127-133, issn 1434-6028, 7 p.Article

Evolution and acquisition of modules in Cartesian Genetic ProgrammingWALKER, James Alfred; MILLER, Julian Francis.Lecture notes in computer science. 2004, pp 187-197, issn 0302-9743, isbn 3-540-21346-5, 11 p.Conference Paper

Nonparametric estimation of conditional functionals from dependent samplesKITAYEVA, A. V; KOSHKIN, G. M; RYUMKIN, V. I et al.Prague conference on information theory, statistical decision functions and random processesPrague symposium on asymptotic statistics. 1998, isbn 80-7015-636-8, 2Vol, vol 1, 295-300Conference Paper

Graphes hiérarchisés pour la spécification des modes de marche = Hierarchized graphs for specification of modes of operationSARTOR, M; SAHRAOUI, A. E. K.Travail et méthodes. 1997, Num 532, pp 17-27, issn 0041-185XArticle

Multi-robot path planning with super-graphsSVESTKA, P; OVERMARS, M. H.CESA'96 IMACS Multiconference : computational engineering in systems applications. 1996, pp 482-487, isbn 2-9510266-1-7Conference Paper

Assortativity of complementary graphsWANG, H; WINTERBACH, W; VAN MIEGHEM, P et al.The European physical journal. B, Condensed matter physics (Print). 2011, Vol 83, Num 2, pp 203-214, issn 1434-6028, 12 p.Article

A material selection model using graph theory and matrix approachVENKATA RAO, R.Materials science & engineering. A, Structural materials : properties, microstructure and processing. 2006, Vol 431, Num 1-2, pp 248-255, issn 0921-5093, 8 p.Article

Representations of graphs and mapsPISANSKI, Tomaz; ZITNIK, Arjana.Information technology interfaces. 2004, pp 19-25, isbn 953-96769-9-1, 7 p.Conference Paper

Topological representation and analysis method for multi-port and multi-orientation docking modular robotsKO, Albert; LAU, T. L; LAU, H. Y. K et al.IEEE International Conference on Robotics and Automation. 2004, pp 2210-2215, isbn 0-7803-8232-3, 5Vol, 6 p.Conference Paper

Categoric and ordinal voting: An overviewBUSZKOWSKI, Wojciech.Theory and Zpplications of Relational Structures as Knowledge Instruments (COST action, 274, TARSKI : revised papers). Lecture notes in computer science. 2003, pp 196-213, issn 0302-9743, isbn 3-540-20780-5, 18 p.Book Chapter

Improving the Refined Triggering Graph Method for active rules termination analysisCOUCHOT, Alain.Lecture notes in computer science. 2002, pp 114-133, issn 0302-9743, isbn 3-540-43905-6, 20 p.Conference Paper

Hierarchical classification of kinematic chains: a multigraph approachSETHI, V. K; AGRAWAL, V. P.Mechanism and machine theory. 1993, Vol 28, Num 4, pp 601-614, issn 0094-114XArticle

Le traitement des ex æquo en analyse de simitude : la réunion des arbres maximaux ou RAM = Tied edges in similarity analysis: The union of the maximum spanning treesFLAMENT, C.Mathématiques, informatique et sciences humaines. 1991, Num 114, pp 35-40, issn 0995-2314Article

A heuristic for minimum-width graph layering with consideration of dummy nodesTARASSOV, Alexandre; NIKOLOV, Nikola S; BRANKE, Jürgen et al.Lecture notes in computer science. 2004, pp 570-583, issn 0302-9743, isbn 3-540-22067-4, 14 p.Conference Paper

Sweeping graphs with large clique numberBOTING YANG; DYER, Danny; ALSPACH, Brian et al.Lecture notes in computer science. 2004, pp 908-920, issn 0302-9743, isbn 3-540-24131-0, 13 p.Conference Paper

Deadlock detection using (0, 1)-labelling of resource allocation graphsCAHIT, I.IEE proceedings. Computers and digital techniques. 1998, Vol 145, Num 1, pp 68-72, issn 1350-2387Article

Object-oriented graph-based geometric feature recognitionSEED, G. M; CLARK, D. E. R; CORNEY, J. R et al.Computer journal (Print). 1996, Vol 39, Num 9, pp 808-811, issn 0010-4620Article

An experience-based assembly sequence planner for mechanical assembliesSWAMINATHAN, A; BARBER, K. S.IEEE transactions on robotics and automation. 1996, Vol 12, Num 2, pp 252-267, issn 1042-296XArticle

Applications of 2-D discrete models for effective solutions of heat transfer problemsTRZASKA, Z. W.CESA'96 IMACS Multiconference : computational engineering in systems applications. 1996, pp 384-389, isbn 2-9502908-5-X, 2VolConference Paper